Non-isolating Bondage in Graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-isolating 2-bondage in graphs

A 2-dominating set of a graph G = (V,E) is a set D of vertices of G such that every vertex of V (G) \D has at least two neighbors in D. The 2-domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b2(G), is the minimum cardinality among all sets of edges E′ ⊆ E such that δ(G − E′) ≥ 1 and γ2(G ...

متن کامل

Roman bondage in graphs

A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value f(V (G)) =

متن کامل

Restrained bondage in graphs

Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. We define the restrained bondage number br(G) of a nonempty graph G to be the minimum cardinality among all sets of edges E′ ⊆...

متن کامل

Total Restrained Bondage in Graphs

A subset S of vertices of a graph G with no isolated vertex is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex in V (G) − S is also adjacent to a vertex in V (G) − S. The total restrained domination number of G is the minimum cardinality of a total restrained dominating set of G. In this paper we initiate the study of total restrained bondage in g...

متن کامل

Bondage and Non-bondage Number of a Fuzzy Graph

In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society

سال: 2015

ISSN: 0126-6705,2180-4206

DOI: 10.1007/s40840-015-0290-2